The Homology of Partitions with an Even Number of Blocks
نویسنده
چکیده
Let Pe2n denote the subposet obtained by selecting even ranks in the partition lattice P2n. We show that the homology of Pe2n has dimension (2n)! E2n-1, where E2n-1 is the tangent number. It is thus an integral multiple of both the Genocchi number and an Andre or simsun number. Using the general theory of rankselected homology representations developed in [22], we show that, for the special case of Pe2n, the character of the symmetric group S2n on the homology is supported on the set of involutions. Our proof techniques lead to the discovery of a family of integers bi(n), 2 < i < n, defined recursively. We conjecture that, for the full automorphism group S2n, the homology is a sum of permutation modules induced from Young subgroups of the form Si2 x S2n-2i1, with nonnegative integer multiplicity bi(n). The nonnegativity of the integers bi(n) would imply the existence of new refinements, into sums of powers of 2, of the tangent number and the Andre or simsun number an(2n). Similarly, the restriction of this homology module to S2n-1 yields a family of integers di(n), 1 < i < n — 1, such that the numbers 2 id i (n) refine the Genocchi number G2n. We conjecture that 2 i d i (n) is a positive integer for all i. Finally, we present a recursive algorithm to generate a family of polynomials which encode the homology representations of the subposets obtained by selecting the top k ranks of Pe2n, 1 < k < n — 1. We conjecture that these are all permutation modules for S2n.
منابع مشابه
Plethysm, Partitions with an Even Number of Blocks and Euler Numbers
This paper is based on an hour address given at the Sixth Conference on Formal Power Series and Algebraic Combinatorics, held at DIMACS in 1994. It is written primarily for an audience of combinatorialists. Our hope is to publicise some intriguing enumerative conjectures which arise in the study of the homology representations of the poset of (set) partitions with an even number of blocks. The ...
متن کاملCFD analysis of natural convection heat transfer in a square cavity with partitions utilizing Al2O3 nanofluid
In the present study, natural convective heat transfer in a partitioned square cavity utilizing nanofluids is studied. The vertical left and right walls are considered as the hot and cold walls, respectively and the partitions assumed to be adiabatic. The nanofluid used in this study is Al2O3 with the volume fraction of 20%. It is assumed that nanofluid is a single phase f...
متن کاملStirling number of the fourth kind and lucky partitions of a finite set
The concept of Lucky k-polynomials and in particular Lucky χ-polynomials was recently introduced. This paper introduces Stirling number of the fourth kind and Lucky partitions of a finite set in order to determine either the Lucky k- or Lucky χ-polynomial of a graph. The integer partitions influence Stirling partitions of the second kind.
متن کاملCFD analysis of natural convection heat transfer in a square cavity with partitions utilizing Al2O3 nanofluid
In the present study, natural convective heat transfer in a partitioned square cavity utilizing nanofluids is studied. The vertical left and right walls are considered as the hot and cold walls, respectively and the partitions assumed to be adiabatic. The nanofluid used in this study is Al2O3 with the volume fraction of 20%. It is assumed that nanofluid is a single phase f...
متن کاملk-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کامل